A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games

In this note we show that the asymmetric Prover-Delayer game developed in (ECCC, TR10–059) for Parameterized Resolution is also applicable to other treelike proof systems. In particular, we use this asymmetric Prover-Delayer to show a lower bound of the form 2Ω(n logn) for the pigeonhole principle in tree-like Resolution. This gives a new and simpler proof of the same lower bound established by Dantchev and Riis (CCC, 2001).